Flexible Prime-Field Genus 2 Hyperelliptic Curve Cryptography Processor with Low Power Consumption and Uniform Power Draw
نویسندگان
چکیده
منابع مشابه
A Flexible, Prime-Field, Genus 2 Hyperelliptic- Curve Cryptography Processor with Low Power Consumption and Uniform Power Draw
prime-field hyperelliptic-curve cryptography (HECC) processor with uniform power draw. The HECC processor performs divisor scalar multiplication on the Jacobian of genus 2 hyperelliptic curves defined over prime fields for arbitrary field and curve parameters. It supports the most frequent case of divisor doubling and addition. The optimized implementation, which is synthesized in a 0.13 mm sta...
متن کاملLow Power Elliptic Curve Cryptography
This M.S. thesis introduces new modulus scaling techniques for transforming a class of primes into special forms which enable efficient arithmetic. The scaling technique may be used to improve multiplication and inversion in finite fields. We present an efficient inversion algorithm that utilizes the structure of a scaled modulus. Our inversion algorithm exhibits superior performance to the Euc...
متن کاملHyperelliptic Curve Cryptography
The use of elliptic-curve groups in cryptography, suggested by Miller [1] and Koblitz [2] three decades ago,provides the same level of security for the Discrete Logarithm Problem as multiplicative groups, with much smallerkey sizes and parameters. The idea was refined two years later by Koblitz, who worked with the group formed bythe points of the Jacobian of hyperelliptic curve...
متن کاملElliptic and Hyperelliptic Curve Cryptography
Definition 1. Let k be a field. An algebraic variety over k is a k-scheme X such that there exists a covering by a finite number of affine open subschemes Xi which are affine varieties over k, i.e. each Xi is the affine scheme associated to a finitely generated algebra over k. A projective variety over k is a projective scheme over k, i.e. a k-scheme isomorphic to Proj k[T0, . . . , Tn]/I for a...
متن کاملLow-Power Elliptic Curve Cryptography Using Scaled Modular Arithmetic
We introduce new modulus scaling techniques for transforming a class of primes into special forms which enables efficient arithmetic. The scaling technique may be used to improve multiplication and inversion in finite fields. We present an efficient inversion algorithm that utilizes the structure of scaled modulus. Our inversion algorithm exhibits superior performance to the Euclidean algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ETRI Journal
سال: 2015
ISSN: 1225-6463
DOI: 10.4218/etrij.15.0114.0418